Towards an Optimal Method for Dynamic Planar Point Location
نویسندگان
چکیده
منابع مشابه
Optimal Expected-Case Planar Point Location
Point location is the problem of preprocessing a planar polygonal subdivision S of size n into a data structure in order to determine efficiently the cell of the subdivision that contains a given query point. We consider this problem from the perspective of expected query time. We are given the probabilities pz that the query point lies within each cell z ∈ S. The entropy H of the resulting dis...
متن کاملNearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision the probability that a query point lies within this polygon. The goal is to compute a search structure to determine which cell of the subdivision contains a given query point, so as to minimize the expected search time....
متن کاملPoint Location in Dynamic Planar Subdivisions
We study the point location problem on dynamic planar subdivisions that allows insertions and deletions of edges. In our problem, the underlying graph of a subdivision is not necessarily connected. We present a data structure of linear size for such a dynamic planar subdivision that supports sublinear-time update and polylogarithmic-time query. Precisely, the amortized update time is O( √ n log...
متن کاملI/o-eecient Dynamic Planar Point Location
We present the rst provably I/O-e cient dynamic data structure for point location in a general planar subdivision. Our structure uses O(N=B) disk blocks to store a subdivision of size N , where B is the disk block size. Queries can be answered in O(log2 B N) I/Os in the worst-case, and insertions and deletions can be performed in O(log B N) and O(log B N) I/Os amortized, respectively. Previousl...
متن کاملNew Results on Dynamic Planar Point Location
A point location scheme is presented for an n-veriet dynamic planar subdivision whose underlying graph is only required to be connected. The scheme uses O(n) space, yields an O(log2 n) query time and an O(1ogn) update time. Insertion (resp. deleiion) of an arbitrary k-edge chain inside a region can be performed in O(klog(n+k)) (resp. O(k1ogn)) iime. The scheme is then ectended to speed up the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2018
ISSN: 0097-5397,1095-7111
DOI: 10.1137/16m1066506